Error bounds on block Gauss–Seidel solutions of coupled multiphysics problems

نویسندگان

  • J. P. Whiteley
  • K. Gillow
  • S. J. Tavener
  • A. C. Walter
چکیده

Mathematical models in many fields often consist of coupled sub-models, each of which describes a different physical process. For many applications, the quantity of interest from these models may be written as a linear functional of the solution to the governing equations. Mature numerical solution techniques for the individual sub-models often exist. Rather than derive a numerical solution technique for the full coupled model, it is therefore natural to investigate whether these techniques may be used by coupling in a block Gauss–Seidel fashion. In this study, we derive two a posteriori bounds for such linear functionals. These bounds may be used on each Gauss–Seidel iteration to estimate the error in the linear functional computed using the single physics solvers, without actually solving the full, coupled problem. We demonstrate the use of the bound first by using a model problem from linear algebra, and then a linear ordinary differential equation example. We then investigate the effectiveness of the bound using a non-linear coupled fluid-temperature problem. One of the bounds derived is very sharp for most linear functionals considered, allowing us to predict very accurately when to terminate our block Gauss–Seidel iteration. Copyright 2011 John Wiley & Sons, Ltd.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combining Penalty-based and Gauss-Seidel Methods for solving Stochastic Mixed-Integer Problems

In this paper, we propose a novel decomposition approach for mixed-integer stochastic programming (SMIP) problems that is inspired by the combination of penalty-based Lagrangian and block Gauss-Seidel methods (PBGS). In this sense, PBGS is developed such that the inherent decomposable structure that SMIPs present can be exploited in a computationally efficient manner. The performance of the pro...

متن کامل

Rapid error reduction for block Gauss-Seidel based on p-hierarchical basis

We consider a two-level block Gauss-Seidel iteration for solving systems arising from finite element discretizations employing higher-order elements. A p-hierarchical basis is used to induce this block structure. Using superconvergence results normally employed in the analysis of gradient recovery schemes, we argue that a massive reduction of H1-error occurs in the first iterate, so that the di...

متن کامل

A New Analysis of Block Preconditioners for Saddle Point Problems

We consider symmetric saddle point matrices. We analyze block preconditioners based on the knowledge of a good approximation for both the top left block and the Schur complement resulting from its elimination. We obtain bounds on the eigenvalues of the preconditioned matrix that depend only of the quality of these approximations, as measured by the related condition numbers. Our analysis applie...

متن کامل

An approximate block Newton method for coupled iterations of nonlinear solvers: Theory and conjugate heat transfer applications

A new, approximate block Newton (ABN) method is derived and tested for the coupled solution of nonlinear models, each of which is treated as a modular, black box. Such an approach is motivated by a desire to maintain software flexibility without sacrificing solution efficiency or robustness. Though block Newton methods of similar type have been proposed and studied, we present a unique derivati...

متن کامل

Matrices, Moments and Quadrature Ii or How to Compute the Norm of the Error in Iterative Methods

Abstract. In this paper, we study the numerical computation of the errors in linear systems when using iterative methods. This is done by using methods to obtain bounds or approximations of quadratic forms uT A−1u where A is a symmetric positive definite matrix and u is a given vector. Numerical examples are given for the Gauss–Seidel algorithm. Moreover, we show that using a formula for the A–...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011